Monotone Simultaneous Embeddings of Paths in R^d
نویسندگان
چکیده
We study the following problem: Given k paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension d > 2, there is a set of d+ 1 paths that does not admit a monotone simultaneous geometric embedding.
منابع مشابه
Monotone Simultaneous Embeddings of Upward Planar Digraphs
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first consider the special case where each digraph is a directed path. In contrast to the known result that any two directed paths admit a monotone simultaneous embedding...
متن کاملMonotone Simultaneous Embedding of Directed Paths
We consider a variant of monotone simultaneous embeddings (MSEs) of directed graphs where all graphs are directed paths and have distinct directions of monotonicity. In contrast to the known result that any two directed paths admit an MSE, there exist examples of three paths that do not admit such an embedding for any possible choice of directions of monotonicity. We prove that if an MSE of thr...
متن کاملColored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored p...
متن کاملMaximum Gradient Embeddings and Monotone Clustering
Let (X, dX) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f : X → T such that for every x ∈ X, ED [ max y∈X\{x} dT ( f (x), f (y)) dX(x, y) ] ≤ C(log n), where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient...
متن کاملPath Schematization for Route Sketches
Motivated from drawing route sketches, we consider the following path schematization problem. We are given a simple embedded polygonal path P = (v1, . . . , vn) and a set C of admissible edge orientations including the coordinate axes. The problem is to redraw P schematically such that all edges are drawn as line segments that are parallel to one of the specified orientations. We also require t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.08791 شماره
صفحات -
تاریخ انتشار 2016